Saddle Points and Pareto Points in Multiple Objective Programming

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Saddle Points and Pareto Points in Multiple Objective Programming

In this paper relationships between Pareto points and saddle points in multiple objective programming are investigated. Convex and nonconvex problems are considered and the equivalence between Pareto points and saddle points is proved in both cases. The results are based on scalarizations of multiple objective programs and related linear and augmented Lagrangian functions. Partitions of the ind...

متن کامل

Saddle Points

To compute the maximum likelihood estimates the log-likelihood function L is maximized with respect to all model parameters. To check that the maximization has been achieved two things have to be satisfied: 1. The vector of first derivatives with respect to the model parameter L′ should be equal to 0. 2. The negative of the matrix of the second derivatives −L′′ should be a positive definite mat...

متن کامل

Approximate Saddle Points Portfolios

We introduce the concept of saddle points portfolio and we establish a connection between this concept and the approximate minima.

متن کامل

Mountain Passes and Saddle Points

Variational methods find solutions of equations by considering a solution as a critical point of an appropriately chosen function. Local minima and maxima are well-known types of critical points. We explore methods for finding critical points that are neither local maxima or minima, but instead are mountain passes or saddle points. Criteria for the existence of minima or maxima are well-known, ...

متن کامل

Efficient storage of Pareto points in biobjective mixed integer programming

In biobjective mixed integer linear programs (BOMILPs), two linear objectives are minimized over a polyhedron while restricting some of the variables to be integer. Since many of the techniques for finding or approximating the Pareto set of a BOMILP use and update a subset of nondominated solutions, it is highly desirable to efficiently store this subset. We present a new data structure, a vari...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Global Optimization

سال: 2005

ISSN: 0925-5001,1573-2916

DOI: 10.1007/s10898-004-5902-6